Some inequalities for the Tutte polynomial
نویسندگان
چکیده
We prove that the Tutte polynomial of a coloopless paving matroid is convex along the portions of the line segments x + y = p lying in the positive quadrant. Every coloopless paving matroid is in the class of matroids which contain two disjoint bases or whose ground set is the union of two bases. For this latter class we give a proof that TM (a, a) ≤ max{TM (2a, 0), TM (0, 2a)} for a ≥ 2. We conjecture that TM (1, 1) ≤ max{TM (2, 0), TM (0, 2)} for the same class of matroids. We also prove this conjecture for some families of graphs and matroids.
منابع مشابه
Tutte polynomials of wheels via generating functions
We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.
متن کاملOn the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کاملOn Bernstein Type Inequalities for Complex Polynomial
In this paper, we establish some Bernstein type inequalities for the complex polynomial. Our results constitute generalizations and refinements of some well-known polynomial inequalities.
متن کاملInequalities of Bonferroni-galambos Type with Applications to the Tutte Polynomial and the Chromatic Polynomial
In this paper, we generalize the classical Bonferroni inequalities and their improvements by Galambos to sums of type ∑ I⊆U (−1)|I|f(I) where U is a finite set and f : 2 → R. The result is applied to the Tutte polynomial of a matroid and the chromatic polynomial of a graph.
متن کاملFlow Polynomial of some Dendrimers
Suppose G is an nvertex and medge simple graph with edge set E(G). An integervalued function f: E(G) → Z is called a flow. Tutte was introduced the flow polynomial F(G, λ) as a polynomial in an indeterminate λ with integer coefficients by F(G,λ) In this paper the Flow polynomial of some dendrimers are computed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 32 شماره
صفحات -
تاریخ انتشار 2011